Recursive Unary Algebras and Trees

نویسنده

  • Bakhadyr Khoussainov
چکیده

Khoussainov, B. Recursive “nary algebras and trees, Annals of Pure and Applied Logic 67 (1994) 213-268. A unary algebra is an algebraic system d = (A,f,, ,L). wheref,, . ,fm are unary operations on A and n EW. In the paper we develop the theory ofeffective “nary algebras. We investigate well-known questions of constructive (recursive) model theory with respect to the class of unary algebras. In the paper we construct “nary algebras with a finite number of recursive isomorphism types. We give the notions of program, uniform, and algebraic dimensions of models, and then we investigate these notions on unary algebras. We find connections between algebraic and effective properties of r.e. representable unary algebras. We also deal with finitely generated r.e. (positive) unary algebras. We show the connections between trees and “nary algebras. Our interests also concern recursive automorphisms groups, r.e. subalgebra and congruence lattices of effective “nary algebras.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On varieties of semigroups and unary algebras∗†

The elementary result of Variety theory is Eilenberg’s Variety theorem which was motivated by characterizations of several families of string languages by syntactic monoids or semigroups, such as Schützenberger’s theorem connecting star-free languages and aperiodic monoids. Eilenberg’s theorem has been extended in various directions. For example, Thérien involved varieties of congruences on fre...

متن کامل

P´olya Urn Models and Connections to Random Trees: A Review

This paper reviews P´olya urn models and their connection to random trees. Basic results are presented, together with proofs that underly the historical evolution of the accompanying thought process. Extensions and generalizations are given according to chronology: • P´olya-Eggenberger’s urn • Bernard Friedman’s urn • Generalized P´olya urns • Extended urn schemes • Invertible urn schemes ...

متن کامل

The eccentric connectivity index of bucket recursive trees

If $G$ is a connected graph with vertex set $V$, then the eccentric connectivity index of $G$, $xi^c(G)$, is defined as $sum_{vin V(G)}deg(v)ecc(v)$ where $deg(v)$ is the degree of a vertex $v$ and $ecc(v)$ is its eccentricity. In this paper we show some convergence in probability and an asymptotic normality based on this index in random bucket recursive trees.

متن کامل

Quantifier Elimination in Term Algebras The Case of Finite Languages

We give a quantifier elimination procedure for term algebras over suitably expanded finite first-order languages. Our expansion is purely functional. Our method works by substituting finitely many parametric test terms. This allows us to obtain in addition sample solutions for an outermost existential quantifier block. The existence of our method implies that the considered quantifier eliminati...

متن کامل

On the Multiplicative Zagreb Indices of Bucket Recursive‎ ‎Trees

‎Bucket recursive trees are an interesting and natural‎ ‎generalization of ordinary recursive trees and have a connection‎ to mathematical chemistry‎. ‎In this paper‎, ‎we give the lower and upper bounds for the moment generating‎ ‎function and moments of the multiplicative Zagreb indices in a‎ ‎randomly chosen bucket recursive tree of size $n$ with maximal bucket size $bgeq1$‎. Also, ‎we consi...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Ann. Pure Appl. Logic

دوره 67  شماره 

صفحات  -

تاریخ انتشار 1994